How Ants Can Efficiently Solve Generalized Watchman Route Problem
نویسندگان
چکیده
This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment where the algorithm is applied to an area containing more than 10 obstructions is described. It proves that efficiency and accuracy of the algorithm are high.
منابع مشابه
Generalized Watchman Route Problem with Discrete View Cost
The watchman route problem (WRP) refers to planning a closed curve, called a watchman route, in a polygon (possibly with holes), with the shortest distance such that every point on the polygon boundary is visible from at least one point on the route. Here we consider the anchored version where the start position is given [5]. Although seemingly very related to two well-known NPhard problems, na...
متن کاملWatchman routes in the presence of a pair of convex polygons
Given a set of polygonal obstacles in the plane, the shortest watchman route problem asks for a closed route from which each point in the exterior of the polygons is visible to some point along the route. This problem is known to be NP-hard and the development of an eecient approximation algorithm is still open. We present an O(n 2) time algorithm for computing the shortest watchman route for a...
متن کاملA Linear-time Algorithm for Orthogonal Watchman Route Problem with Minimum Bends
Given an orthogonal polygon P with n vertices, the goal of the watchman route problem is finding a path S of the minimum length in P such that every point of the polygon P is visible from at least one of the point of S. In the other words, in the watchman route problem we must compute a shortest watchman route inside a simple polygon of n vertices such that all the points interior to the polygo...
متن کاملAn Approximate Algorithm for Solving the Watchman Route Problem
The watchman route problem (WRP) was first introduced in 1988 and is defined as follows: How to calculate a shortest route completely contained inside a simple polygon such that any point inside this polygon is visible from at least one point on the route? So far the best known result for the WRP is an O(nlogn) runtime algorithm (with inherent numerical problems of its implementation). This pap...
متن کاملOn The Watchman Route Problem and Its Related Problems
We propose to study the watchman route problem and its related problems. The watchman route problem asks a shortest closed path within a given polygon so that every point in the polygon is visible from at least one point on the path. We first discuss the watchman route problem for simple polygons, for polygonal domains, and for arrangements of lines and line segments. We then focus on a problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJSIR
دوره 2 شماره
صفحات -
تاریخ انتشار 2011